package 力扣._1143最长公共子序列;

public class Solution {
    public int longestCommonSubsequence(String text1, String text2) {
        //dp[i][j]: 以s1[i-1],s2[j-1]为结束位置的最长公共子序列的大小
        int[][] dp = new int[text1.length() + 1][text2.length() + 1];
        for (int i = 1; i <= text1.length(); i++) {
            for (int j = 1; j <= text2.length(); j++) {
                if (text1.charAt(i - 1) == text2.charAt(j - 1))
                    dp[i][j] = dp[i - 1][j - 1] + 1;
                else
                    dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]);
            }
        }
        return dp[text1.length()][text2.length()];
    }
}
